ADE spectral networks

Ade Irawan (1010203)

None of data communication systems is absolutely reliable in practice because of noise, distortions, interferences, or other forms of impairments. Therefore, the systems need error control strategies in order to detect or to correct errors occurring in the transmission process. Controlling transmission errors in data communication systems can be performed by using either automatic-repeat-reques...

Reliable MIX Cas ade

ADE and SLE

We point out that the probability law of a single domain wall separating clusters in ADE lattice models in a simply connected domain is identical to that of corresponding chordal curves in the lattice O(n) and Q-state Potts models, for suitable n or Q. They are conjectured to be described in the scaling limit by chordal SLEκ with κ rational and >2. However in a multiply-connected domain the law...

Orbifold Cohomology of ADE-singularities

We study Ruan’s cohomological crepant resolution conjecture [39] for orbifolds with transversal ADE singularities. In the An-case we compute both the orbifold cohomology ring H ∗ orb([Y ]) and the quantum corrected cohomology ring H(Z)(q1, ..., qn). The former is achieved in general, the later up to some additional, technical assumptions. We construct an explicit isomorphism between H orb([Y ])...

Spectral Alignment of Networks

Network alignment refers to the problem of finding a bijective mapping across vertices of two or more graphs to maximize the number of overlapping edges and/or to minimize the number of mismatched interactions across networks. This paper introduces a network alignment algorithm inspired by eigenvector analysis which creates a simple relaxation for the underlying quadratic assignment problem. Ou...